Transfinite Constructions in Classical Type Theory
نویسندگان
چکیده
We study a transfinite construction we call tower construction in classical type theory. The construction is inductive and applies to partially ordered types. It yields the set of all points reachable from a starting point with an increasing successor function and a family of admissible suprema. Based on the construction, we obtain type-theoretic versions of the theorems of Zermelo (well-orderings), Hausdorff (maximal chains), and Bourbaki and Witt (fixed points). The development is formalized in Coq assuming excluded middle.
منابع مشابه
مقایسه نتایج حل ترموالاستیک نیم‌فضا میان
In this paper, transfinite element method is used to analyze the two dimensional thermoelasticity problems. A comparison is made between the thermoelastic analysis results of the classical theory and theories with one or two relaxation times (i.e. L-S and G-L theories), for the half space problem. Governing equations are transformed to Laplace domain and then, node variables are calculated by t...
متن کاملContinuity, proof systems and the theory of transfinite computations
The purpose of this paper is to show how the concept of transfinite computations relative to certain functionals of type 3 can be used to construct topologies and transfinite proof systems adding extra structure to some sets transfinitly definable over the continuum. Our aim is to initiate a fine-structure analysis of sets of the form Lκ(HC). We will motivate this below. Before doing so, let us...
متن کاملLexicographic Path Induction
Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of equality in type theory, equivalence testing of traces in security, etc. Although the principle of transfinite induction is routinely employed by logicians in proving such theorems, it is rarely used by programming languages r...
متن کاملFunctional interpretation and inductive definitions
Extending Gödel’s Dialectica interpretation, we provide a functional interpretation of classical theories of positive arithmetic inductive definitions, reducing them to theories of finite-type functionals defined using transfinite recursion on well-founded trees.
متن کاملArithmetical transfinite induction and hierarchies of functions
We generalize to the case of arithmetical transfinite induction the following three theorems for PA: the Wainer Theorem, the Paris–Harrington Theorem, and a version of the Solovay–Ketonen Theorem. We give uniform proofs using combinatorial constructions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015